Patterns with several multiple eigenvalues

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spaces of Matrices with Several Zero Eigenvalues

Let V be an w-dimensional vector space over some field F, \F\ ^ n, and let SC be a space of linear mappings from V into itself {SC ^ Horn (V, V)) with the property that every mapping has at least r zero eigenvalues. If r = 0 this condition is vacuous but if r = 1 it states that SC is a space of singular mappings; in this case Flanders [1] has shown that d im#"^n(n — 1) and that if dim #" = n(n ...

متن کامل

Multiple Eigenvalues

The dimensions of sets of matrices of various types, with specified eigenvalue multiplicities, are determined. The dimensions of the sets of matrices with given Jordan form and with given singular value multiplicities are also found. Each corresponding codimension is the number of conditions which a matrix of the given type must satisfy in order to have the specified multiplicities.

متن کامل

On Multiple Eigenvalues of Trees

Let T be a tree of order n > 6 with μ as a positive eigenvalue of multiplicity k. Star complements are used to show that (i) if k > n/3 then μ = 1, (ii) if μ = 1 then, without restriction on k, T has k+ 1 pendant edges that form an induced matching. The results are used to identify the trees with a non-zero eigenvalue of maximum possible multiplicity.

متن کامل

A Parallel Davidson-Type Algorithm for Several Eigenvalues

In this paper we propose a new parallelization of the Davidson algorithm adapted for many eigenvalues. In our parallelization we use a relationship between two consecutive subspaces which allows us to calculate eigenvalues in the subspace through an arrowhead matrix. Theoretical timing estimates for the parallel algorithm are developed and compared against our numerical results on the Paragon. ...

متن کامل

Renewal Theory for Several Patterns

The results presented in this paper were motivated by a study of certain patterns, known as restriction sites, in DNA sequences. DNA sequences can be thought of as finite words over a four-letter alphabet {A, T, G, C}, and restriction sites are (sequence-specific) locations of positions in double-stranded DNA where it is cut by a protein known as a restriction enzyme. See Watson (1977). For exa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Special Matrices

سال: 2014

ISSN: 2300-7451

DOI: 10.2478/spma-2014-0020